A bounding algorithm for the broadcast storm problem in mobile ad hoc networks

Many protocols used in Mobile Ad Hoc Networks rely on the broadcasting capability, especially when performing a route discovery process. However, an efficient broadcasting protocol should be devised to reduce the unnecessary redundant rebroadcasting at some nodes (redundancy) as well as to increase the coverage area as much as possible (reachability). A few approaches have been developed in the literature. We propose a bounding algorithm which is shown to be an efficient candidate to accommodate the two goals, that is to increase reachability while limiting redundancy.